Applying Sanskrit Concepts for Reordering in MT
نویسندگان
چکیده
This paper presents a rule-based reordering approach for English-Hindi machine translation. We have used the concept of pada, from Pān. inian Grammar to frame the reordering rules. A pada is a word form which is ready to participate in a sentence. The rules are generic enough to apply on any English-Indian language pair. We tested the rules on English-Hindi language pair and obtained better comprehensibility score as compared to Google Translate on the same test set. In assessing the effectiveness of the rules on padas which are analogous to minimal phrases in English, we achieved upto 93% accuracy on the test data.
منابع مشابه
A joint translation model with integrated reordering
This dissertation aims at combining the benefits and to remedy the flaws of the two popular frameworks in statistical machine translation, namely Phrasebased MT and N-gram-based MT. Phrase-based MT advanced the state-of-the art towards translating phrases3 than words. By memorizing phrases, phrasal MT, is able to learn local reorderings, and handling of other local dependencies such as insertio...
متن کاملContinuous Space Reordering Models for Phrase-based MT
Bilingual sequence models improve phrase-based translation and reordering by overcoming phrasal independence assumption and handling long range reordering. However, due to data sparsity, these models often fall back to very small context sizes. This problem has been previously addressed by learning sequences over generalized representations such as POS tags or word clusters. In this paper, we e...
متن کاملTwo Word Reordering Strategies in English - to - Chinese Translation
In English-to-Chinese machine translation, reordering mistakes are frequently caused by miss-located prepositional phrases(PP). In English, a PP is often located after its attached host, while in Chinese things are the opposite. Recent phrase-based MT approaches tend to ignore such syntax information. In our work, we propose two strategies to resolve the above problem: first, for MT that adopts...
متن کاملHandling of Infinitives in English to Sanskrit Machine Translation
The development of Machine Translation (MT) system for ancient language like Sanskrit is a fascinating and challenging task. In this paper, the authors handle the infinitive type of English sentences in the English to Sanskrit machine translation (EST) system. The EST system is an integrated model of a rule-based approach of machine translation with Artificial Neural Network (ANN) model that tr...
متن کاملSanskrit Machine Translation Systems: A Comparative Analysis
Machine Translation is area of research since six decades. It is gaining popularity since last decade due to better computational facilities available at personal computer systems. This paper presents different Machine Translation system where Sanskrit is involved as source, target or key support language. Researchers employ various techniques like Rule based, Corpus based, Direct for machine t...
متن کامل